Derandomization for k-submodular maximization
نویسنده
چکیده
Submodularity is one of the most important property of combinatorial optimization, and k-submodularity is a generalization of submodularity. Maximization of a k-submodular function is NP-hard, and approximation algorithm has been studied. For monotone k-submodular functions, [Iwata, Tanigawa, and Yoshida 2016] gave k/(2k−1)-approximation algorithm. In this paper, we give a deterministic algorithm by derandomizing that algorithm. Our algorithm is k/(2k−1)-approximation and runs in polynomial time.
منابع مشابه
Deterministic Algorithms for Submodular Maximization Problems
Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area most algorithms are randomized, and in almost all cases the approximation ratios obtained by current randomized algorithms are superior to the best results obtained by known deterministic algor...
متن کاملOn maximizing a monotone k-submodular function subject to a matroid constraint
A k-submodular function is an extension of a submodular function in that its input is given by k disjoint subsets instead of a single subset. For unconstrained nonnegative ksubmodular maximization, Ward and Živný proposed a constant-factor approximation algorithm, which was improved by the recent work of Iwata, Tanigawa and Yoshida presenting a 1/2-approximation algorithm. Iwata et al. also pro...
متن کاملMaximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Unlike submodular minimization, submodular maximization is NP-hard. In this paper, we give the firs...
متن کاملTowards Minimizing k-Submodular Functions
In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively. In particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization...
متن کاملMonotone k-Submodular Function Maximization with Size Constraints
A k-submodular function is a generalization of a submodular function, where the input consists of k disjoint subsets, instead of a single subset, of the domain. Many machine learning problems, including influence maximization with k kinds of topics and sensor placement with k kinds of sensors, can be naturally modeled as the problem of maximizing monotone k-submodular functions. In this paper, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1610.07729 شماره
صفحات -
تاریخ انتشار 2016